package Day2025_03_12;

public class LeetCodeLCR166 {
    public int jewelleryValue(int[][] f) {
        int m = f.length, n = f[0].length;
        int[][] dp= new int[m + 1][n + 1];
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]) + f[i - 1][j - 1];
            }
        }
        return dp[m][n];
    }
}
